<title>排座位</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;stdio.h&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;string.h&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define maxn 1000005</span>
<span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">],</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">sa</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">],</span> <span class="pl-n">rank</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">],</span> <span class="pl-n">sign</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">ss</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">[],</span> <span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">sa</span><span class="pl-p">[],</span> <span class="pl-kt">int</span> <span class="pl-n">rank</span><span class="pl-p">[])</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">count</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">];</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">count</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">count</span><span class="pl-p">));</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">count</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span><span class="pl-o">++</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;</span> <span class="pl-n">maxn</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">count</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">+=</span> <span class="pl-n">count</span><span class="pl-p">[</span><span class="pl-n">i</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">];</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">rank</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">count</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span><span class="pl-o">--</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">sa</span><span class="pl-p">[</span><span class="pl-n">rank</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span> <span class="pl-o">=</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;seat.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span> <span class="pl-n">stdin</span><span class="pl-p">);</span>
    <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;seat.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span> <span class="pl-n">stdout</span><span class="pl-p">);</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-n">ss</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-p">,</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">sa</span><span class="pl-p">,</span> <span class="pl-n">rank</span><span class="pl-p">);</span>
    <span class="pl-kt">int</span> <span class="pl-n">circle</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">sign</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])</span> <span class="pl-p">{</span>
            <span class="pl-n">sign</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-o">++</span><span class="pl-n">circle</span><span class="pl-p">;</span>
            <span class="pl-kt">int</span> <span class="pl-n">x</span> <span class="pl-o">=</span> <span class="pl-n">sa</span><span class="pl-p">[</span><span class="pl-n">rank</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]];</span>
            <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">sign</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">])</span> <span class="pl-p">{</span>
                <span class="pl-n">sign</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">circle</span><span class="pl-p">;</span>
                <span class="pl-n">x</span> <span class="pl-o">=</span> <span class="pl-n">sa</span><span class="pl-p">[</span><span class="pl-n">rank</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]];</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">n</span> <span class="pl-o">-</span> <span class="pl-n">circle</span><span class="pl-p">);</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>